On the Laplacian spectral radius of weighted trees with a positive weight set
نویسندگان
چکیده
منابع مشابه
The p-Laplacian spectral radius of weighted trees with a degree sequence and a weight set
In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.
متن کاملEla the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗
In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.
متن کاملOn the Laplacian spectral radius of a graph
Let G be a simple graph with n vertices and m edges and Gc be its complement. Let δ(G) = δ and (G) = be the minimum degree and the maximum degree of vertices of G, respectively. In this paper, we present a sharp upper bound for the Laplacian spectral radius as follows: λ1(G) ( + δ − 1)+ √ ( + δ − 1)2 + 4(4m− 2δ(n− 1)) 2 . Equality holds if and only if G is a connected regular bipartite graph. A...
متن کاملOn the Laplacian spectral radius of a tree
Let G be a graph; its Laplacian matrix is the difference of the diagonal matrix of its vertex degrees and its adjacency matrix. In this paper, we present a sharp upper bound for the Laplacian spectral radius of a tree in terms of the matching number and number of vertices, and deduce from that the largest few Laplacian spectral radii over the class of trees on a given number of vertices. © 2003...
متن کاملThe integral trees with spectral radius 3
There are 11 integral trees with largest eigenvalue 3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.10.020